Technical Note—A Note on Integer Maximization of Unimodal Functions
نویسندگان
چکیده
منابع مشابه
On Integer Multiflow Maximization
Generalizing the two-commodity ow theorem of Rothschild and Whinston and the multiiow theorem of Lovv asz and Cherkasskij, Karzanov and Lomonosov proved a min-max theorem on maximum multiiows in the seventies. Their original proof is quite long and technical and relies on earlier investigations on metrics. The main purpose of the present paper is to provide a relatively simple proof of this the...
متن کاملA note on the budgeted maximization of submodular functions
Many set functions F in combinatorial optimization satisfy the diminishing returns property F{A U X) — F(A) > F(A' U X) — F(A') for A C A!. Such functions are called submodular. A result from Nemhauser etal. states that the problem of selecting ^-element subsets maximizing a nondecreasing submodular function can be approximated with a constant factor (1 — 1/e) performance guarantee. Khuller eta...
متن کاملTECHNICAL NOTE - A Note on Profit Maximization and Monotonicity for Inbound Call Centers
We consider an inbound call center with a fixed reward per call and communication and agent costs. By controlling the number of lines and the number of agents we can maximize the profit. Abandonments are included in our performance model. Monotonicity results for the maximization problem are obtained, which leads to an efficient optimization procedure. We give a counterexample to the concavity ...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Integer Convex Maximization
We show that an important broad class of integer programming problems in variable dimension with convex objective functions is solvable in polynomial time, and discuss various applications including to multiway transportation problems, packing problems and partitioning problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1975
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.23.2.358